On the Orchard Crossing Number of the Complete Bipartite Graphs Kn,n
نویسندگان
چکیده
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs Kn,n.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملA Good Drawing of Complete Bipartite Graph K9,9, Whose Crossing Number Holds Zarankiewicz Conjectures
There exist some Drawing for any graph G = (V,E) on plan. An important aim in Graph Theory and Computer science is obtained a best drawing of an arbitrary graph. Also, a draw of a non-planar graph G on plan generate several edge-cross. A good drawing (or strongly best drawing) of G is consist of minimum edge-cross. The crossing number of a graph G, is the minimum number of crossings in a drawin...
متن کاملOn the Orchard crossing number of complete bipartite graphs
Let G be an abstract graph. Motivated by the Orchard relation, introduced in [3, 4], we have defined the Orchard crossing number of G [5], in a similar way to the well-known rectilinear crossing number of an abstract graph G (denoted by cr(G), see [1, 8]). A general reference for crossing numbers can be [6]. The Orchard crossing number is interesting for several reasons. First, it is based on t...
متن کاملImproved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming
It has been long conjectured that the crossing numbers of the complete bipartite graph Km,n and of the complete graph Kn equal Z(m,n) := ⌊
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011